Capacity Regions for Broadcast Channels With Degraded Message Sets and Message Cognition Under Different Secrecy Constraints
نویسندگان
چکیده
This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional private messages for these two receivers, such that each receiver is only interested in one message, while being fully cognizant of the other one. First, this model is investigated without any secrecy constraints, where the capacity region is established. This result implies that the straightforward extension of Körner and Marton inner bound to the investigated scenario is optimal. In particular, this agrees with Nair and Wang result, which states that the idea of indirect decoding –introduced to improve Körner and Marton inner bound– does not provide a better region for this scenario. Further, some secrecy constraints are introduced by letting the private messages to be confidential ones. Two different secrecy criteria are considered: joint secrecy and individual secrecy. For both criteria, a general achievable rate region is provided, in addition to establishing the secrecy capacity regions, if the two legitimate receivers are more capable than the eavesdropper. The established capacity regions indicate that the individual secrecy criterion can provide a larger capacity region as compared to the joint one, because the cognizant messages can be used as a secret keys for the other messages. Moreover, the joint secrecy capacity is established for a more general class of more capable channels, where only one of the two legitimate receivers is more capable than the eavesdropper by proving the optimality of the principle of indirect decoding introduced by Nair and El Gamal for this class of channels. This result is in contrast with the non-secrecy case, where the indirect decoding does not provide any gain.
منابع مشابه
The Three-Receiver Broadcast Channel with Degraded Message Sets and Confidential Messages
In this paper, bounds to the secrecy capacity region for the general 3-receiver broadcast channel with 3 degraded message sets, are presented for confidential messages sent to be kept secret from one of the receivers. This model is a more general model than 2-receiver broadcast channels with confidential messages with an external wiretapper, and recently studied 3-receiver degraded broadcast ch...
متن کاملThe Secrecy Capacity for a 3-Receiver Broadcast Channel with Degraded Message Sets
In this paper, we study the secrecy capacity region for the 3-receiver broadcast channel (BC) with degraded message sets, where a confidential message is kept secret from one of the receivers. This model is more general than the previously studied degraded broadcast channel (BC) with confidential messages, as the wiretap receiver is supposed to receive the common message. Our main results are t...
متن کاملThe capacity of a class of 3-receiver broadcast channels with degraded message sets
Körner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Körner-Marton region to more than 2 receivers is optimal. This paper shows that this is not the case. We establish the capacity region for a class of 3-receiver broadcast channels with 2 degraded message...
متن کاملThe Capacity Region of a Class of 3-Receiver Broadcast Channels with Degraded Message Sets
Körner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Körner-Marton region to more than 2 receivers is optimal. This paper shows that this is not the case. We establish the capacity region for a class of 3-receiver broadcast channels with 2-degraded message...
متن کاملBroadcast Channel with Receiver Side Information: Achieving Individual Secrecy
In this paper, we study the problem of secure communication over the broadcast channel with receiver side information, under the lens of individual secrecy constraints (i.e., information leakage from each message to an eavesdropper is made vanishing). Several coding schemes are proposed by extending known results in broadcast channels to this secrecy setting. In particular, individual secrecy p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1501.04490 شماره
صفحات -
تاریخ انتشار 2015